On disjoint sets of differences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Disjoint Sets of Differences

must hold, where A(x) denotes the number of elements of A up to x. It is quite natural to ask how much the situation changes if we cut A into two parts, A' and A ", and demand only that no a i' a, should coincide with any a i ' -a,' . This question was proposed by Erdős and Graham in [2], and it seemed likely that no considerable increase can be achieved in the density of A . We shall show, how...

متن کامل

On Crossing Sets, Disjoint Sets and the Pagenumber 1

Let G = (V;E) be a t-partite graph with n vertices and m edges, where the partite sets are given. We present an O(n2m1:5) time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing edges, and at the same time, the size of the largest set of disjoint (pairwise non-crossing) edges are O(pt m). As an application we embed G in a book of O(pt m) p...

متن کامل

Almost disjoint families on large underlying sets

We show that, for any poset P, the existence of a P-indestructible mad family F ⊆ [ω]א0 is equivalent to the existence of such a family over אn for some/all n ∈ ω. Under the very weak square principle ¤∗∗∗ ω1,μ of Fuchino and Soukup [7] and cf([μ]א0 ,⊆) = μ+ for all limit cardinals μ of cofinality ω, the equivalence for any proper poset P transfers to all cardinals. That is, under these assumpt...

متن کامل

Tuples of Disjoint NP-Sets

Disjoint NP-pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint NP-pairs to disjoint k-tuples of NP-sets for k ≥ 2. We define subclasses of the class of all disjoint k-tuples of NP-sets. These subclasses are associated with a proposition...

متن کامل

Remarks about disjoint dominating sets

We solve a number of problems posed by Hedetniemi, Hedetniemi, Laskar, Markus, and Slater concerning pairs of disjoint sets in graphs which are dominating or independent and dominating.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 1984

ISSN: 0022-314X

DOI: 10.1016/0022-314x(84)90046-5